Assuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks
نویسندگان
چکیده
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve those characteristics but only at the expense of using per-flow states and signaling, which are not scalable and difficult to implement. Alternatively, the stateless approaches proposed up to now are focused either on providing guaranteed services similar to those offered by IntServ or on ensuring a reasonably fair bandwidth allocation. In this paper we propose a stateless architecture – the Fair Bandwidth Allocation Control (Fair-BAC) – that ensures both the adherence to the given throughput guarantees and a fair allocation of the remaining bandwidth between the flows that do not have any reservation and the out-of-profile fraction of the flows with reservation. The capabilities of Fair-BAC are demonstrated in a set of simulations performed for various degrees of congestion and using sources with different conformance levels.
منابع مشابه
Adaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks
In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملQueue Length Based Fair Queueing in Core - Stateless Networks 1
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملAdaptive CSFQ: determining the packet dropping probability adaptively for achieving fair bandwidth allocations in SCORE networks
In stateless core (SCORE) networks, edge routers maintain per flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملCore-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks
Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...
متن کاملQueue Length Based Fair Queueing in Core-Stateless Networks
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003